Using E - Unification to Handle Equality in Universal Formula Semantic Tableaux — Extended

نویسنده

  • Bernhard Beckert
چکیده

In this paper we describe how a combination of the classical “universal” E-unification and “rigid”E-unification, called “mixed” E-unification, can be used to efficiently handle equality in universal formula semantic tableaux, that are an extension of free variable tableaux.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Mixed Universal and Rigid E-Unification to Handle Equality in Universal Formula Semantic Tableaux

In this paper we describe how a combination of the classical “universal” E-unification and “rigid” Eunification, called “mixed” E-unification, can be used to efficiently handle equality in universal formula semantic tableaux, that are an extension of free variable tableaux.

متن کامل

A Completion-Based Method for Mixed Universal and Rigid E-Unification

We present a completion-based method for handling a new version of E-unification, called “mixed” E-unification, that is a combination of the classical “universal” E-unification and “rigid” E-unification. Rigid E-unification is an important method for handling equality in Gentzen-type first-order calculi, such as free-variable semantic tableaux or matings. The performance of provers using E-unif...

متن کامل

Bernhard Beckert Rigid E - Unification

By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...

متن کامل

Rigid E-unification

By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...

متن کامل

Semantic Tableaux with Equality

This paper tries to identify the basic problems encountered in handling equality in the semantic tableau framework, and to describe the state of the art in solving these problems. The two main paradigms for handling equality are compared: adding new tableau expansion rules and using E-unification algorithms.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994